Duality, dirty paper coding, and capacity for multiuser wireless channels
نویسندگان
چکیده
We introduce techniques that shed new light on the capacity analysis of multiuser channels, and apply these techniques to broadcast and multiple access channels. We rst determine a duality between broadcast and multiple access channels that can be used to obtain the capacity region and optimal transmission strategy for one channel based on the capacity-achieving transmission strategy and region for the dual channel. This duality result is applicable to additive Gaussian noise and fading channels for several di erent notions of fading channel capacity, including ergodic capacity, outage capacity, and minimum rate capacity. Duality provides a powerful connection between the broadcast channel and multiple access channel capacity regions that solves many open capacity problems, and also greatly simpli es the calculation of known regions. We next consider the dirty paper coding strategy of Costa for broadcast channels. Dirty paper coding exploits the known interference between users in a broadcast channel to presubtract out this interference. We apply this coding strategy to broadcast channels with multiple antennas at the transmitter and receiver (the MIMO channel). We show that dirty paper coding provides signi cant rate gains over the high-data-rate (HDR) strategy used in current cellular systems. We next turn our attention to the MIMO broadcast channel capacity region. Since this channel is in general non-degraded, its capacity region remains an unsolved problem. We rst establish a duality between the achievable region of the MIMO broadcast channel using dirty paper coding and the capacity region of the dual MIMO multiple-access channel, which is easy to compute. We then show that dirty paper coding achieves sumrate capacity of the MIMO broadcast channel. The proof exploits duality, dirty paper coding, and clever upper bounding techniques.
منابع مشابه
Multi - User Communication Systems : Capacity , Duality , and Cooperation
In this thesis we investigate the capacity of multi-user wireless communication channels. We first establish a duality relationship between the Gaussian broadcast and multiple-access channels. This relationship allows us to characterize the capacity region of the Gaussian broadcast channel in terms of the dual Gaussian multiple-access channel, and vice versa. This relationship holds for constan...
متن کاملNested Codes for Constrained Memory and for Dirty Paper
Dirty paper coding are relevant for wireless networks, multiuser channels, and digital watermarking. We show that the problem of dirty paper is essentially equivalent to some classes of constrained memories, and we explore the binary so-called nested codes, which are used for e cient coding and error-correction on such channels and memories.
متن کاملCognitive Radio MIMO Gaussian Broadcast Channels with the Power Constraint
The cognitive radio multiple-input multiple-output Gaussian broadcast channels are studied where multiple antennas are available for both primary users and secondary users in a spectrum sharing environment, and the sum-rate capacity is also obtained under both the SUs’ transmit power constraint and interference power constraint at the primary receivers. The paper principally consists of two ste...
متن کاملCapacity limits of MIMO channels
We provide an overview of the extensive recent results on the Shannon capacity of single-user and multiuser multiple-input multiple-output (MIMO) channels. Although enormous capacity gains have been predicted for such channels, these predictions are based on somewhat unrealistic assumptions about the underlying time-varying channel model and how well it can be tracked at the receiver, as well a...
متن کاملOn " Dirty-paper Coding "
regardless of what Q is. The title of Costa’s work came by making an analogy to the problem of writing on dirty paper, where the reader cannot nominally distinguish dirt from ink. There are many scenarios where this result may be applied. In the field of information hiding (or watermarking), a message is encoded in u, which is to be embedded in the host waveform i using the signal s. Data compr...
متن کامل